<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Easy
  </div>
  <div>
   <h1 class="question_title">
    206. Reverse Linked List
   </h1>
   <p>
    Reverse a singly linked list.
   </p>
   <p>
    <strong>
     Example:
    </strong>
   </p>
   <pre>
<strong>Input:</strong> 1-&gt;2-&gt;3-&gt;4-&gt;5-&gt;NULL
<strong>Output:</strong> 5-&gt;4-&gt;3-&gt;2-&gt;1-&gt;NULL
</pre>
   <p>
    <b>
     Follow up:
    </b>
   </p>
   <p>
    A linked list can be reversed either iteratively or recursively. Could you implement both?
   </p>
  </div>
  <div>
   <h1 class="question_title">
    206. 反转链表
   </h1>
   <p>
    反转一个单链表。
   </p>
   <p>
    <strong>
     示例:
    </strong>
   </p>
   <pre><strong>输入:</strong> 1-&gt;2-&gt;3-&gt;4-&gt;5-&gt;NULL
<strong>输出:</strong> 5-&gt;4-&gt;3-&gt;2-&gt;1-&gt;NULL</pre>
   <p>
    <strong>
     进阶:
    </strong>
    <br>
    你可以迭代或递归地反转链表。你能否用两种方法解决这道题？
   </p>
  </div>
 </body>
</html>